Barter trade improves message delivery in opportunistic networks

نویسندگان

  • Levente Buttyán
  • László Dóra
  • Márk Félegyházi
  • István Vajda
چکیده

In opportunistic networks, selfish nodes can exploit the services provided by other nodes by downloading messages that interest them, but refusing to store and distribute messages for the benefit of other nodes. We propose a mechanism to discourage selfish behavior based on the principles of barter. We develop a game-theoretic model in which we show that the proposed approach indeed stimulates cooperation of the nodes. The results show that, in practical scenarios, the message delivery rate considerably increases, if the mobile nodes follow the Nash Equilibrium strategy in the proposed mechanism compared to the data dissemination protocol when no encouraging mechanism is present. 2009 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Congestion-Aware Node Cooperation Mechanism based on Double Auction for Opportunistic Networks

In opportunistic networks, selfish nodes will refuse to forward messages for others to save their precious resources such as bandwidth, buffer and energy, and the system performance will degrade significantly. Therefore, it is necessary to motivate the selfish nodes to cooperatively forward messages. However, current cooperation mechanisms for opportunistic networks mainly focus on encouraging ...

متن کامل

A Global One-Way Control Channel for Opportunistic Networks

In this paper, we explore the challenge of limited global knowledge in opportunistic networks. Using a low bandwidth global one-way control channel, e.g., provided through the data side channel of FM radio, we mitigate this limitation. In the case of Epidemic Routing in Delay Tolerant Networks, enhancing the acknowledgment mechanism for delivered messages using this channel improves message del...

متن کامل

A Utility-based Multi-copy Forwarding Algorithm in Delay Tolerant Networks

In delay tolerant networks (DTNs) with uncertainty in node mobility, message forwarding usually employs a multi-copy, opportunistic forwarding scheme to improve delivery probability. Minimizing the delivery latency (delay) and minimizing the number of forwardings (message copies) have been two conflicting goals. On the other hand, utility-based routing has been proposed in multi-hop wireless ne...

متن کامل

Community-based Message Opportunistic Transmission

Mobile Social Networks (MSNs) is a kind of opportunistic networks, which is composed of a large number of mobile nodes with social characteristic. Up to now, the prevalent communitybased routing algorithms mostly select the most optimal social characteristic node to forward messages. But they almost don't consider the effect of community distribution on mobile nodes and the time-varying charact...

متن کامل

Social-Based Trust Mechanisms in Mobile Opportunistic Networks

The fundamental challenge in opportunistic networking, regardless of the application, is enabling node cooperation to forward a message. While node cooperation is considered as a fundamental property in such networks, ensuring such a property between two devices in mobile opportunistic networks remains largely unexplored. In this paper, we investigate the potential impact of the lack of trust o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ad Hoc Networks

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2010